SQLfast scripts of Case studies "Path finders, rovers and Ariadnes thread"
--------------------------------------------------------------------------

Execute main script "Shortest-MAIN.sql"

The main script comprises three sets of applications: "inter-city shortest path", "solving mazes" and "path finding".

Inter-city shortest path
------------------------
  - Inter-City_Solver#1.sql: Loads and solves small inter-city problems, included that of the case study. Calls:
      - _Inter-City_Loader#1.sql, _Inter-City_Loader#2.sql, _Inter-City_Loader#3.sql, _Inter-City_Loader#4.sql
  - Inter-City_Solver#2.sql: Loads and solves large size inter-city problems. 
                             The map is generated as a matrix with all vertical and horizontal roads,
                             with cost = 1. Calls:
      - _Large-grid-maps_Loader.sql: generates the matrix with user-defined dimension.
                             
Solving mazes
-------------
  - Maze_Solver.sql: Loads and solves maze problems. 
                     The map is specified graphically in text file "Maze_map.txt".
                     From this text, program "Generate-Maze.py" generates script "_Maze_Loader.sql"
                     that will load the maze. 
                     A larger maze is available in file "Maze_map_Large.txt".
                     To run it, change its name into "Maze_map.txt".
                     Calls:
      - _Maze_Loader.sql: Loads the maze generated from  text file "Maze_map.txt".

Path finding
------------
  - Rover-on-Planet_Solver.sql: Loads and solve the path-finding problems. Calls:
      - _Rover-on-Planet_Loader.sql: loads the map of the case study. The three costs are set by the user.


These applications call these low level scripts:
  - __Display_Shortest-path.sql: Displays the shortest path and cost between two nodes
  - __Shortest-path_DB.sql:      Create the tables and views of the database
  - __Shortest-path_Engine.sql:  Computes and store in NODE the shortest path between two nodes
  - __Display_Graph.sql:         Displays the nodes of the current graph with their
                                 predecessors and successors
  - __Display_Nodes.sql:         Displays the list of the nodes reachable from the starting
                                 node, with their shortest paths and cost
